Soft Sets with Atoms
نویسندگان
چکیده
The theory of finitely supported structures is used for dealing with very large sets having a certain degree symmetry. This framework generalizes the classical set Zermelo-Fraenkel by allowing infinitely many basic elements no internal structure (atoms) and equipping group actions permutation over these elements. On other hand, soft represent generalization fuzzy to deal uncertainty in parametric manner. In this paper, we study new structures, associating any crisp family atoms describing it. We prove some finiteness properties infinite sets, order Tarski-like fixed point results mappings between atoms.
منابع مشابه
Soft regular generalized b-closed sets in soft topological spaces
The main purpose of this paper is to introduce and study new classes of soft closed sets like soft regular generalized b-closed sets in soft topological spaces (briefly soft rgb-closed set) Moreover, soft rg-closed, soft gpr-closed, soft gb-closed, soft gsp-closed, soft g$alpha$-closed, soft g$alpha$b-closed, and soft sgb-closed sets in soft topological spaces are introduced in this paper and w...
متن کاملOn transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملAPPLICATIONS OF SOFT SETS IN HILBERT ALGEBRAS
The concept of soft sets, introduced by Molodtsov [20] is a mathematicaltool for dealing with uncertainties, that is free from the difficultiesthat have troubled the traditional theoretical approaches. In this paper, weapply the notion of the soft sets of Molodtsov to the theory of Hilbert algebras.The notion of soft Hilbert (abysmal and deductive) algebras, soft subalgebras,soft abysms and sof...
متن کاملImperative Programming in Sets with Atoms
We define an imperative programming language, which extends while programs with a type for storing atoms or hereditarily orbit-finite sets. To deal with an orbit-finite set, the language has a loop construction, which is executed in parallel for all elements of an orbit-finite set. We show examples of programs in this language, e.g. a program for minimising deterministic orbit-finite automata. ...
متن کاملCounting numerical sets with no small atoms
A numerical set S with Frobenius number g is a set of integers with min(S) = 0 and max(Z − S) = g, and its atom monoid is A(S) = {n ∈ Z | n+ s ∈ S for all s ∈ S}. Let γg be the number of numerical sets S having A(S) = {0} ∪ (g,∞) divided by the total number of numerical sets with Frobenius number g. We show that the sequence {γg} is decreasing and converges to a number γ∞ ≈ .4844 (with accuracy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10121956